By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 3, Issue 4, pp. 255-326

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Number of $1$'s in Binary Integers: Bounds and Extremal Properties

M. D. McIlroy

pp. 255-261

BibTeX  Abstract Full Text:  PDF

Computationally Related Problems

Sartaj Sahni

pp. 262-279

BibTeX  Abstract Full Text:  PDF

A Note on Perfect Elimination Digraphs

D. J. Kleitman

pp. 280-282

BibTeX  Abstract Full Text:  PDF

Reversal-Bounded Acceptors and Intersections of Linear Languages

Ronald Book, Maurice Nivat, and Michael Paterson

pp. 283-295

BibTeX  Abstract Full Text:  PDF

Existence of Graphs with Three Spanning Trees and Given Degree Sequence

Sukhamay Kundu

pp. 296-298

BibTeX  Abstract Full Text:  PDF

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham

pp. 299-325

BibTeX  Abstract Full Text:  PDF

Erratum: Genetic Algorithms and the Optimal Allocation of Trials

John H. Holland

p. 326

BibTeX  Abstract Full Text:  PDF